/**
 * Definition for a binary tree node.
 * struct TreeNode {
 *     int val;
 *     struct TreeNode *left;
 *     struct TreeNode *right;
 * };
 */

bool isSameTree(struct TreeNode* root1,struct TreeNode* root2)
{
    if(root1==NULL&&root2==NULL) return true;
    if(root1==NULL||root2==NULL) return false;
    if(root1->val!=root2->val) return false;
    return isSameTree(root1->left,root2->right)&&isSameTree(root1->right,root2->left);
}

bool isSymmetric(struct TreeNode* root) 
{
    if(isSameTree(root->left,root->right)) return true;
    else return false;
}
